Further Formalization of the Process Algebra CCS in HOL4
نویسنده
چکیده
In this project, we have extended previous work on the formalization of the process algebra CCS in HOL4. We have added full supports on weak bisimulation equivalence and observation congruence (rooted weak equivalence), with related definitions, theorems and algebraic laws. Some deep lemmas were also formally proved in this project, including Deng Lemma, Hennessy Lemma and several versions of the “Coarsest congruence contained in weak equivalence”. For the last theorem, we have proved the full version (without any assumption) based on ordinals.
منابع مشابه
A Formalization of the Process Algebra CCS in HOL4
An old formalization of the Process Algebra CCS (no value passing, with explicit relabeling operator) has been ported from HOL88 theorem prover to HOL4 (Kananaskis-11 and later). Transitions between CCS processes are defined by SOS (Structural Operational Semantics) rules, then algebaric laws for strong equivalence (including the expansion law) were proved upon SOS transition rules. We used HOL...
متن کاملA Formalization of Unique Solutions of Equations in Process Algebra
In this thesis, a comprehensive formalization of Milner’s Calculus of Communicating Systems (also known as CCS) has been done in HOL theorem prover (HOL4), based on an old work in HOL88. This includes all classical properties of strong/weak bisimulation equivalences and observation congruence, a theory of congruence for CCS, various versions of “bisimulation up to” techniques, and several deep ...
متن کاملAlgebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملFormalization of Linear Space Theory in the Higher-Order Logic Proving System
Theoremproving is an important approach in formal verification.Higher-order logic is a formof predicate logic that is distinguished from first-order logic by additional quantifiers and stronger semantics. Higher-order logic is more expressive. This paper presents the formalization of the linear space theory in HOL4. A set of properties is characterized in HOL4. This result is used to build the ...
متن کاملFormally Analyzing Continuous Aspects of Cyber-Physical Systems Modeled by Homogeneous Linear Differential Equations
Traditionally, the continuous aspects of cyber-physical systems (CPS), usually modeled by differential equations, are analyzed using paper-and-pencil proof methods, computer based numerical methods or computer algebra systems. All these methods are error-prone and thus the analysis cannot be termed as accurate, which poses a serious threat to the accuracy of the cyber-physical systems. To guara...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.04894 شماره
صفحات -
تاریخ انتشار 2017